Minimizers of Convex Functionals Arising in Random Surfaces

نویسندگان

  • D. DE SILVA
  • O. SAVIN
چکیده

We investigate C1 regularity of minimizers to ́ F (∇u)dx in two dimensions for certain classes of non-smooth convex functionals F . In particular our results apply to the surface tensions that appear in recent works on random surfaces and random tilings of Kenyon, Okounkov and others.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of Minimizers of Convex Regularization Functionals

We study variational methods of bounded variation type for the data analysis. Y. Meyer characterized minimizers of the Rudin-Osher-Fatemi functional in dependence of the G-norm of the data. These results and the follow up work on this topic are generalized to functionals defined on spaces of functions with derivatives of finite bounded variation. In order to derive a characterization of minimiz...

متن کامل

Minimizers for a Double-well Problem with Affine Boundary Conditions

This paper is concerned with the existence of minimizers for functionals having a double-well integrand with affine boundary conditions. Such functionals are related to the so-called Kohn-Strang functional which arises in optimal shape design problems in electrostatics or elasticity. They are known to be not quasi-convex, and therefore existence of minimizers is, in general, guaranteed only for...

متن کامل

Evolution by Non-Convex Functionals

We establish a semi-group solution concept for morphological differential equations, such as the mean curvature flow equation. The proposed method consists in generating flows from generalized minimizers of nonconvex energy functionals. We use relaxation and convexification to define generalized minimizers. The main part of this work consists in verification of the solution concept by comparing...

متن کامل

Extremal Convex Sets for Sylvester-busemann Type Functionals

The Sylvester (d + 2)-points problem deals with the probability S(K) that d + 2 random points taken from a convex compact subset K of Rd are not the vertices of any convex polytope and asks for which sets S(K) is minimal or maximal. While it is known that ellipsoids are the only minimizers of S(K), the problem of the maximum is still open, unless d = 2. In this paper we study generalizations of...

متن کامل

Minimization of entropy functionals

Entropy functionals (i.e. convex integral functionals) and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on the constraint set. Dual equalities and characterizations of the minimizers are obtained with weak constraint qualifications.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008